max 1

The proof is based on the splitting technology and the fact that the complexities of renamings of formulas in MAX ( 1 ) are polynomial time .

我们证明了：MAX~+（k）中公式的改名问题在多项式时间内可以判定，并给出相应的算法。

Both MAX ( 1 ) and MARG ( 1 ) are subclasses of the minimal unsatisfiable formulas , and formulas in these subclasses can be represented by trees .

MAX（1）和MARG（1）是极小不可满足公式的两个子类，这两个子类中的公式可以用树表示。

Formulas in the MAX ( 1 ) and MARG ( 1 ), it is shown that the literal renaming problems are solvable in linear time , and the variable renaming problems are solvable in quadratic time .

证明了对于MAX（1）和MARG（1）中的公式，文字改名问题在线性时间内可解，变元改名问题在平方次时间内可解。

Results The results demonstrated that recoveries of LVDP , + dp / dt max in group 1 and group 2 were significantly better than those in control group ( P < 0.05 , P < 0.01 ) .

结果再灌注30分钟时，组1和组2LVDP、+dp/dtmax恢复率显著高于对照组（P<0.05，P<0.01），组3LVDP、±dp/dtmax的恢复率与对照组比较差别无显著性意义。

The max relative error was 1 . 31 % , the average relative error and standard relative error was 0 . 67 % and 0 . 83 % respectively .

平均相对误差0.67%；标准相对误差0.83%。